Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
نویسندگان
چکیده
منابع مشابه
Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems
The unconstrained binary quadratic optimization problem (UQP) is known to be NP-hard and due to its computational challenge and application potential, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is in line with that of Glover, Alidaee, Rego and Kochenberger (2002) who proposed one pass heuristi...
متن کاملSeveral versions of Devour Digest Tidy-up Heuristic for Large-Scale Unconstrained Binary Quadratic Problem
The unconstrained binary quadratic optimization problem (UQP) is known to be NP-hard and due to its computational challenge and application potential, it becomes more and more considered and involved by the recent research studies, including both exact and heuristic solution approaches. Our work is in line with that of Glover, Alidaee, Rego and Kochenberger (2002) who proposed one pass heuristi...
متن کاملNeighborhood Combination for Unconstrained Binary Quadratic Problems
We present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms, using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study. The goal of the analysis is to help understand why, when and how some neighborhoods can be favorably combined to increase their search power. Our study investigates combined neighborhoods with two t...
متن کاملRobust Optimization of Unconstrained Binary Quadratic Problems
In this paper we focus on the unconstrained binary quadratic optimization model, maximize xQx, x binary, and consider the problem of identifying optimal solutions that are robust with respect to perturbations in the Q matrix.. We are motivated to find robust, or stable, solutions because of the uncertainty inherent in the big data origins of Q and limitations in computer numerical precision, pa...
متن کاملDiversification-driven tabu search for unconstrained binary quadratic problems
This paper describes a Diversification-Driven Tabu Search (D2TS) algorithm for solving unconstrained binary quadratic problems. D2TS is distinguished by the introduction of a perturbation-based diversification strategy guided by longterm memory. The performance of the proposed algorithm is assessed on the largest instances from theORLIB library (up to 2500 variables) as well as still larger ins...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2011
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-011-9169-z